t = int(input())
arr = list(map(int, input().split()))
ans = -1
arr.sort()
for i in range(1, arr[-1], 1):
if i == arr[i-1]:
continue
else:
ans = i
break
if ans == -1:
print(arr[-1] + 1)
else:
print(ans)#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
const long int N=1e6;
map<long long int,bool>vis;
int main()
{
fast;
long long int n;
cin>>n;
vector<long long int>vect(n);
for(long long int i(0);i<n;i++){cin>>vect[i];vis[vect[i]]=1;}
long long int i;
for(i=1;i<=3000;i++){
if(vis[i]==0)break;}
cout<<i<<endl;
return 0;}190D - Non-Secret Cypher | 1721B - Deadly Laser |
1721C - Min-Max Array Transformation | 1721A - Image |
1180C - Valeriy and Deque | 557A - Ilya and Diplomas |
1037D - Valid BFS | 1144F - Graph Without Long Directed Paths |
1228A - Distinct Digits | 355B - Vasya and Public Transport |
1230A - Dawid and Bags of Candies | 1530A - Binary Decimal |
1472D - Even-Odd Game | 441C - Valera and Tubes |
1328E - Tree Queries | 265A - Colorful Stones (Simplified Edition) |
296A - Yaroslav and Permutations | 967B - Watering System |
152A - Marks | 1398A - Bad Triangle |
137A - Postcards and photos | 1674D - A-B-C Sort |
334A - Candy Bags | 855A - Tom Riddle's Diary |
1417A - Copy-paste | 1038A - Equality |
1061A - Coins | 1676E - Eating Queries |
1447A - Add Candies | 1721D - Maximum AND |